منابع مشابه
Computability of Convex Sets
We investigate computability of convex sets restricted to ra tional inputs Several quite di erent algorithmic characterizations are presented like the existence of e ective approximations by polygons or e ective line intersection tests We also consider approximate compu tations of the n fold characteristic function for several natural classes of convex sets This yields many di erent concrete ex...
متن کاملComputability of Julia Sets
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
متن کاملAdditive structure of difference sets and a theorem of Følner
A theorem of Følner asserts that for any set A ⊂ Z of positive upper density there is a Bohr neigbourhood B of 0 such that B \ (A − A) has zero density. We use this result to deduce some consequences about the structure of difference sets of sets of integers having a positive upper density.
متن کاملComputability of Self-Similar Sets
We investigate computability of a self-similar set on a Euclidean space. A nonempty compact subset of a Euclidean space is called a self-similar set if it equals to the union of the images of itself by some set of contractions. The main result in this paper is that if all of the contractions are computable, then the self-similar is a recursive compact set. A further result on the case that the ...
متن کاملComputability of Julia Sets - ReadingSample
Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im Sortiment finden Sie alle Medien (Bücher, Zeitschriften, CDs, eBooks, etc.) aller Verlage. Ergänzt wird das Programm durch Services wie Neuerscheinungsdienst oder Zusammenstellungen von Büchern zu Sonderpreisen. Der Shop führt mehr als 8 Millionen Produkte.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2017
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196717500382